Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Poisoning attack detection scheme based on generative adversarial network for federated learning
Qian CHEN, Zheng CHAI, Zilong WANG, Jiawei CHEN
Journal of Computer Applications    2023, 43 (12): 3790-3798.   DOI: 10.11772/j.issn.1001-9081.2022121831
Abstract592)   HTML27)    PDF (2367KB)(379)       Save

Federated Learning (FL) emerges as a novel privacy-preserving Machine Learning (ML) paradigm. However, the distributed training structure of FL is more vulnerable to poisoning attack, where adversaries contaminate the global model through uploading poisoning models, resulting in the convergence deceleration and the prediction accuracy degradation of the global model. To solve the above problem, a poisoning attack detection scheme based on Generative Adversarial Network (GAN) was proposed. Firstly, the benign local models were fed into the GAN to output testing samples. Then, the testing samples were used to detect the local models uploaded by the clients. Finally, the poisoning models were eliminated according to the testing metrics. Meanwhile, two test metrics named F1 score loss and accuracy loss were defined to detect the poisoning models and extend the detection scope from one single type of poisoning attacks to all types of poisoning attacks. Besides, a threshold determination method was designed to deal with misjudgment, so that the robust of misjudgment was confirmed. Experimental results on MNIST and Fashion-MNIST datasets show that the proposed scheme can generate high-quality testing samples, and then detect and eliminate poisoning models. Compared with the global models trained with the detection scheme based on directly gathering test data from clients and the detection scheme based on generating test data and using test accuracy as the test metric, the global model trained with the proposed scheme has significant accuracy improvement from 2.7 to 12.2 percentage points.

Table and Figures | Reference | Related Articles | Metrics
Multi-objective particle swarm optimization with decomposition for network community discovery
YING Jiawei CHEN Yuzhong
Journal of Computer Applications    2013, 33 (09): 2444-2449.   DOI: 10.11772/j.issn.1001-9081.2013.09.2444
Abstract629)      PDF (821KB)(435)       Save
A multi-objective particle swarm optimization with decomposition for network community discovery was proposed and the multi-objective optimization model of community discovery was constructed through comparing the optimization objectives of different community discovery algorithms in social network. The proposed algorithm adopted the Chebyshev method to decompose the multi-objective optimization problem into a number of single-objective optimization sub-problems and used Particle Swarm Optimization (PSO) to discover the community structure. Moreover, a new local search based mutation strategy was put forward to improve the search efficiency and speed up convergence. The proposed algorithm overcame the defects of single objective optimization methods. The experimental results on synthetic networks and real-world networks show that the proposed algorithm can discover the community structure rapidly and accurately and reveal the hierarchical community structure.
Related Articles | Metrics